λ¬Έμ
π Logic
for (int i = 0; i < N; i++)
userStage.add(new Stage(i + 1));
for (int s : stages) {
if (s > N) continue;
userStage.get(s - 1).incFail();
}
for (Stage s : userStage) {
if (users == 0) break;
double tmp = s.fail / users;
users -= s.fail;
s.setFail(tmp);
}
ArrayList<Stage>λ₯Ό μ¬μ©ν΄ λλ¬ν μΈμ μμ μ€ν¨μ¨μ μ μ₯- λμ΄λλ³ λλ¬ μΈμ μλ₯Ό 0μΌλ‘ μ΄κΈ°νν ν, μ€ν¨μ¨ κ³μ°μ μν λλ¬νμ§λ§ ν΄λ¦¬μ΄νμ§ λͺ»ν μΈμ μλ₯Ό κ³μ°
-
μ λμ΄λλΆν°, ν΄λ¦¬μ΄νμ§ λͺ»ν μΈμ μ / μ 체 μΈμλ‘ μ€ν¨μ¨μ κ³μ°νλ€.
- μ΄ν μ 체 μΈμμ ν΄λΉ λμ΄λμ λλ¬νμ§λ§ ν΄λ¦¬μ΄νμ§ λͺ»ν μΈμ μλ§νΌ μ°¨κ°νλ€.
π CODE
μ½λ 보기/μ κΈ°π«
import java.util.*;
class Stage implements Comparable<Stage> {
int user;
double fail;
public Stage(int user) {
this.user = user;
this.fail = 0;
}
public void incFail() {
this.fail += 1;
}
public void setFail(double fail) {
this.fail = fail;
}
@Override
public int compareTo(Stage o) {
if (o.fail == this.fail) return this.user - o.user;
if (o.fail > this.fail) return 1;
return -1;
}
}
class Solution {
public int[] solution(int N, int[] stages) {
double users = stages.length;
ArrayList<Stage> userStage = new ArrayList<>();
for (int i = 0; i < N; i++)
userStage.add(new Stage(i + 1));
for (int s : stages) {
if (s > N) continue;
userStage.get(s - 1).incFail();
}
for (Stage s : userStage) {
if (users == 0) break;
double tmp = s.fail / users;
users -= s.fail;
s.setFail(tmp);
}
Collections.sort(userStage);
int[] answer = new int[N];
for (int i = 0; i < N; i++)
answer[i] = userStage.get(i).user;
return answer;
}
}
βοΈ Review
- μ¬μ΄ λ¬Έμ μμΌλ μ’ λ ν¨μ¨μ μΈ μλ£κ΅¬μ‘°λ₯Ό λΉ λ₯Έ μκ° λ΄μ λ μ¬λ¦¬μ§ λͺ»ν κ² λ¬Έμ μλ€.